Balancing Lexicographic Fairness and a Utilitarian Objective with Application to Kidney Exchange

نویسندگان

  • Duncan C. McElfresh
  • John P. Dickerson
چکیده

Balancing fairness and efficiency in resource allocation is a classical economic and computational problem. The price of fairness measures the worst-case loss of economic efficiency when using an inefficient but fair allocation rule; for indivisible goods in many settings, this price is unacceptably high. One such setting is kidney exchange, where needy patients swap willing but incompatible kidney donors. In this work, we close an open problem regarding the theoretical price of fairness in modern kidney exchanges. We then propose a general hybrid fairness rule that balances a strict lexicographic preference ordering over classes of agents, and a utilitarian objective that maximizes economic efficiency. We develop a utility function for this rule that favors disadvantaged groups lexicographically; but if cost to overall efficiency becomes too high, it switches to a utilitarian objective. This rule has only one parameter which is proportional to a bound on the price of fairness, and can be adjusted by policymakers. We apply this rule to real data from a large kidney exchange and show that our hybrid rule produces more reliable outcomes than other fairness rules.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Price of Fairness in Failure-Aware Kidney Exchange

Fielded kidney exchanges typically use utilitarian or near-utilitarian matching rules, potentially at great cost to certain classes of hardto-match patients. Dickerson, Procaccia, and Sandholm [6] recently adapted the price of fairness, a measure of the tradeoff between fairness and efficiency, to kidney exchange; they showed that the price of fairness is small in theory but often non-negligibl...

متن کامل

Price of fairness in kidney exchange

Kidney exchange provides a life-saving alternative to long waiting lists for patients in need of a new kidney. Fielded exchanges typically match under utilitarian or near-utilitarian rules; this approach marginalizes certain classes of patients. In this paper, we focus on improving access to kidneys for highly-sensitized, or hard-tomatch, patients. Toward this end, we formally adapt a recently ...

متن کامل

A Tutorial on Max-Min Fairness and its Applications to Routing, Load-Balancing and Network Design

This tutorial is devoted to the notion of Max-Min Fairness (MMF), associated optimization problems, and their applications to multi-commodity flow networks. We first introduce a theoretical background for the MMF problem and discuss its relation to lexicographic optimization. We next present resolution algorithms for the MMF optimization, and then give some applications to telecommunication net...

متن کامل

Balancing Efficiency and Fairness in Dynamic Kidney Exchange

The preferred treatment for kidney failure is a transplant; however, demand for donor kidneys far outstrips supply. Kidney exchange, an innovation where willing but incompatible donor-patient pairs can exchange organs—via cycles and altruist-initiated chains— provides a life-saving alternative to long waiting lists for deceased-donor organs. Typically, fielded exchanges act myopically, consider...

متن کامل

A Unified Approach to Dynamic Matching and Barter Exchange

The exchange of indivisible goods without money addresses a variety of constrained economic settings where a medium of exchange—such as money—is considered inappropriate. Participants are either matched directly with another participant or, in more complex domains, in barter cycles and chains with many other participants before exchanging their endowed goods. This thesis addresses the design, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1702.08286  شماره 

صفحات  -

تاریخ انتشار 2017